TSTP Solution File: SET017^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET017^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:17:22 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 38 ( 33 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 36 ( 9 ~; 16 |; 4 &; 4 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-3 aty)
% Number of variables : 16 ( 6 ^ 10 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_25,type,
unord_pair: $i > $i > $i > $o ).
thf(decl_36,type,
esk1_0: $i ).
thf(decl_37,type,
esk2_0: $i ).
thf(decl_38,type,
esk3_0: $i ).
thf(unord_pair,axiom,
( unord_pair
= ( ^ [X1: $i,X3: $i,X4: $i] :
( ( X4 = X1 )
| ( X4 = X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bszUfrSLdM/E---3.1_5312.p',unord_pair) ).
thf(thm,conjecture,
! [X1: $i,X3: $i,X22: $i] :
( ( ( unord_pair @ X1 @ X3 )
= ( unord_pair @ X1 @ X22 ) )
=> ( X3 = X22 ) ),
file('/export/starexec/sandbox2/tmp/tmp.bszUfrSLdM/E---3.1_5312.p',thm) ).
thf(c_0_2,plain,
( unord_pair
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( Z2 = Z0 )
| Z2 ) ) ),
inference(fof_simplification,[status(thm)],[unord_pair]) ).
thf(c_0_3,negated_conjecture,
~ ! [X1: $i,X3: $i,X22: $i] :
( ! [X26: $i] :
( ( ( X26 = X1 )
| ( X26 = X3 ) )
<=> ( ( X26 = X1 )
| ( X26 = X22 ) ) )
=> ( X3 = X22 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_2])]) ).
thf(c_0_4,negated_conjecture,
! [X30: $i] :
( ( ( X30 != esk1_0 )
| ( X30 = esk1_0 )
| ( X30 = esk3_0 ) )
& ( ( X30 != esk2_0 )
| ( X30 = esk1_0 )
| ( X30 = esk3_0 ) )
& ( ( X30 != esk1_0 )
| ( X30 = esk1_0 )
| ( X30 = esk2_0 ) )
& ( ( X30 != esk3_0 )
| ( X30 = esk1_0 )
| ( X30 = esk2_0 ) )
& ( esk2_0 != esk3_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i] :
( ( X1 = esk1_0 )
| ( X1 = esk2_0 )
| ( X1 != esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ( X1 = esk1_0 )
| ( X1 = esk3_0 )
| ( X1 != esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_5]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_7]),c_0_6]),c_0_8]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET017^1 : TPTP v8.1.2. Released v3.6.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 10:34:13 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running higher-order theorem proving
% 0.20/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.bszUfrSLdM/E---3.1_5312.p
% 0.20/0.53 # Version: 3.1.0-ho
% 0.20/0.53 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.53 # Starting sh1l with 300s (1) cores
% 0.20/0.53 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.53 # post_as_ho1 with pid 5434 completed with status 0
% 0.20/0.53 # Result found by post_as_ho1
% 0.20/0.53 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: HGUPF-FFSF00-SHSSMFNN
% 0.20/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.53 # new_ho_10 with pid 5437 completed with status 0
% 0.20/0.53 # Result found by new_ho_10
% 0.20/0.53 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: HGUPF-FFSF00-SHSSMFNN
% 0.20/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 29
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 19
% 0.20/0.53 # Removed in clause preprocessing : 16
% 0.20/0.53 # Initial clauses in saturation : 3
% 0.20/0.53 # Processed clauses : 5
% 0.20/0.53 # ...of these trivial : 0
% 0.20/0.53 # ...subsumed : 0
% 0.20/0.53 # ...remaining for further processing : 4
% 0.20/0.53 # Other redundant clauses eliminated : 2
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 0
% 0.20/0.53 # Backward-rewritten : 0
% 0.20/0.53 # Generated clauses : 2
% 0.20/0.53 # ...of the previous two non-redundant : 2
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 0
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 2
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 1
% 0.20/0.53 # ...of those cached : 0
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 2
% 0.20/0.53 # Positive orientable unit clauses : 1
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 1
% 0.20/0.53 # Non-unit-clauses : 0
% 0.20/0.53 # Current number of unprocessed clauses: 0
% 0.20/0.53 # ...number of literals in the above : 0
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 0
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.53 # Non-unit clause-clause subsumptions : 0
% 0.20/0.53 # Unit Clause-clause subsumption calls : 0
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 0
% 0.20/0.53 # BW rewrite match successes : 0
% 0.20/0.53 # Condensation attempts : 5
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 871
% 0.20/0.53 # Search garbage collected termcells : 137
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.004 s
% 0.20/0.53 # System time : 0.001 s
% 0.20/0.53 # Total time : 0.005 s
% 0.20/0.53 # Maximum resident set size: 1804 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.005 s
% 0.20/0.53 # System time : 0.003 s
% 0.20/0.53 # Total time : 0.008 s
% 0.20/0.53 # Maximum resident set size: 1748 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E exiting
%------------------------------------------------------------------------------